How to slove exercise 27.4-3
Show that any comparison network that can merge 1 item with n-1 sorted items to produce a sorted sequence of length n must have depth at least lg(n).